Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
721	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
722	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons Xiuxia Pan, Fajie Li∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 Analysis of algorithms Computational complexity theory Time complexity Pi Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
723	Channel Based Scheduling of Parallelizable Tasks Jason Glasgow CenterLine Software Cambridge, MA, USA Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-17 12:08:56 Operations research Mathematical optimization Scheduling Parallel computing Job shop scheduling Multiprocessor scheduling Speedup Algorithm Computational complexity theory Theoretical computer science Applied mathematics Concurrent computing
724	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
725	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals Alexander Idelberger∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-27 21:29:04 Auxiliary function NP-complete problems Mathematics Forcing 8J
726	ICS 161 — Algorithms — Winter 2005 — First Midterm Please answer the following six questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-04-21 19:41:07 Sorting algorithms Computational complexity theory Algorithm Mathematical logic Prime number Radix sort Multiplication algorithm Time complexity Anatolii Alexeevitch Karatsuba Mathematics Theoretical computer science Multiplication
727	Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc Add to Reading List Source URL: teamcore.usc.edu Language: English - Date: 2008-10-14 04:00:37 Applied mathematics Operations research Distributed constraint optimization Convex optimization Computational complexity theory Constraint satisfaction problem Linear programming Constraint optimization Combinatorial optimization Constraint programming Mathematical optimization Theoretical computer science
728	Measuring Empirical Computational Complexity Simon F. Goldsmith∗ Alex S. Aiken Computer Science Dept. Add to Reading List Source URL: daniel-wilkerson.appspot.com Language: English Estimation theory Parallel computing Project management Scalability Transaction processing Cluster analysis Linear regression Computer cluster Regression analysis Statistics Computing Econometrics
729	Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation Add to Reading List Source URL: www.secfac.wisc.edu Language: English - Date: 2014-10-24 10:53:47 Applied mathematics Travelling salesman problem Mathematical optimization Complexity classes Combinatorial optimization Theoretical computer science Computational complexity theory Operations research
730	Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He Add to Reading List Source URL: www.cse.uconn.edu Language: English - Date: 2004-02-16 16:47:53 Computational complexity theory Message Passing Interface Speedup Algorithm Hamiltonian path Time complexity Bulk synchronous parallel Parallel algorithm Parallel Random Access Machine Theoretical computer science Parallel computing Computing

UPDATE